A formal system of partial recursive functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mutually Recursive Partial Functions

We provide a wrapper around the partial-function command which supports mutual recursion. Our results have been used to simplify the development of mutually recursive parsers, e.g., a parser to convert external proofs given in XML into some mutually recursive datatype within Isabelle/HOL.

متن کامل

A Type of Partial Recursive Functions

Our goal is to define a type of partial recursive functions in constructive type theory. In a series of previous articles, we studied two different formulations of partial functions and general recursion. We could obtain a type only by extending the theory with either an impredicative universe or with coinductive definitions. Here we present a new type constructor that eludes such entities of d...

متن کامل

Partial Recursive Functions and Finality

We seek universal categorical conditions ensuring the representability of all partial recursive functions. In the category Pfn of sets and partial functions, the natural numbers provide both an initial algebra and a final coalgebra for the functor 1 + −. We recount how finality yields closure of the partial functions on natural numbers under Kleene’s μ-recursion scheme. Noting that Pfn is not c...

متن کامل

On Modal Logics of Partial Recursive Functions

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both...

متن کامل

Aggregating Inductive Expertise on Partial Recursive Functions

The notion of an inductive inference machine aggregating a team of inference machines models the problem of making use of several explanations for a single phenomenon. This article investigates the amount of information necessary for a successful aggregation of the theories given by a team of inference machines. Variations of using different kinds of identitication and aggregation are investiga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences

سال: 1974

ISSN: 0034-5318

DOI: 10.2977/prims/1195192182